The asymptotic variance rate of the output process of finite capacity birth-death queues

نویسندگان

  • Yoni Nazarathy
  • Gideon Weiss
چکیده

We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form λ∗ + ∑ vi where λ ∗ is the rate of outputs and vi are functions of the birth and death rates. We show that if the birth rates are non-increasing and the death rates are non-decreasing (as is common in many queueing systems) then the values of vi are strictly negative and thus the limiting index of dispersion of counts of the output process is less than unity. In the M/M/1/K case, our formula evaluates to a closed form expression that shows the following phenomenon: When the system is balanced, i.e. the arrival and service rates are equal, ∑ vi λ∗ is minimal. The situation is similar for the M/M/c/K queue, the Erlang loss system and some PH/PH/1/K queues: In all these systems there is a pronounced decrease in the asymptotic variance rate when the system parameters are balanced.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The asymptotic variance of departures in critically loaded queues

We consider the asymptotic variance of the departure counting processD(t) of the GI/G/1 queue;D(t) denotes the number of departures up to time t. We focus on the case that the system load % equals 1, and prove that the asymptotic variance rate satisfies lim t→∞ VarD(t) t = λ ( 1− 2 π )( ca + c 2 s ) , where λ is the arrival rate and ca, cs are squared coefficients of variation of the inter-arri...

متن کامل

به‌دست آوردن میانگین زمان تکمیل‌پروژه در شبکه‌های پرت‌پویا‌ (سیستم چندپروژه‌ای) با ظرفیت محدود

In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...

متن کامل

The intercept term of the asymptotic variance curve for some queueing output processes

We consider the output processes of some elementary queueing models such as the M/M/1/K queue and the M/G/1 queue. An important performance measure for these counting processes is their variance curve v(t), which gives the variance of the number of customers in the time interval [0, t]. Recent work has revealed some non-trivial properties dealing with the asymptotic rate at which the variance c...

متن کامل

Two-Time-Scale Markov Chains and Applications to Quasi-Birth-Death Queues

Aiming at reduction of complexity, this work is concerned with two-time-scale Markov chains and applications to quasi-birth-death queues. Asymptotic expansions of probability vectors are constructed and justified. Lumping all states of the Markov chain in each subspace into a single state, an aggregated process is shown to converge to a continuous-time Markov chain whose generator is an average...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2008